Multidimensional Impossible Polycubes
نویسنده
چکیده
We first derive a 3-dimensional impossible polycube by forcibly deforming the projection of a 3-dimensional polycube. This procedure is extended into n(≥4)-space to construct n-dimensional impossible polycubes represented in 2or 3-space. They are useful as fundamental grid patterns for imaging various n-dimensional impossible figures in our 3-space. On 2-space, especially, each pattern can be composed of [n/2] kinds of rhombi grouped into n congruent periodic portions which spirally fill a semi-regular 2n-gon. The same [n/2] kinds of rhombi compose a radial quasi-periodic pattern in a regular 2n-gon which is derived from the projection of an n-dimensional polycube. Basic n-dimensional figures in this paper An n-dimensional impossible polycube (an impossible n-polycube) in this paper is composed of mainly two kinds of n-dimensional regular polytopes. One is the n-dimensional cube (n-cube) as the 2n-cell composed of 2n numbers of (n-1)-cubes, while the other is the n-dimensional regular tetrahedron (n-tetrahedron) as the (n+1)-cell or n-dimensional simplex composed of n+1 numbers of (n-1)-tetrahedra. Several n-cubes may construct an n-polycube which is a portion of space-filling agglomeration of n-cubes. On the contrary, 3-dimensional regular tetrahedra (3-tetrahedra) can fill 3-space with 3-dimensional regular octahedra, each being the dual of a 3-cube. Buckminster Fuller’s octet-truss or the polyoctet in this paper is a portion of this triangular 3-dimensional space-filling agglomeration (Figure 1). They are usually represented by orthogonal isometric projections into 2or 3-space in this paper. Figure 1 : Left three columns, solid models with each line pattern of n-cubes embedded in regular 2n-gons (top row) and that of n-tetrahedra embedded in regular (n+1)-gons (bottom row). From left to right, n=3, 4, and 5. Right end column, line patterns of a 3-polycube (top) and a polyoctet (bottom). CG: M. Ishii. Proceedings of Bridges 2013: Mathematics, Music, Art, Architecture, Culture
منابع مشابه
Enumeration of Specific Classes of Polycubes
The aim of this paper is to gather several new results concerning the enumeration of specific classes of polycubes. We first consider two classes of 3-dimensional vertically-convex directed polycubes: the plateau polycubes and the parallelogram polycubes. An expression of the generating function is provided for the former class, as well as an asymptotic result for the number of polycubes of eac...
متن کاملFormulae and Growth Rates of High-Dimensional Polycubes
A d-dimensional polycube is a facet-connected set of cubes in d dimensions. Fixed polycubes are considered distinct if they differ in their shape or orientation. A proper d-dimensional polycube spans all the d dimensions, that is, the convex hull of the centers of its cubes is d-dimensional. In this paper we prove rigorously some (previously conjectured) closed formulae for fixed (proper and im...
متن کاملHow many faces can polycubes of lattice tilings by translation of R have?
We construct a class of polycubes that tile the space by translation in a latticeperiodic way and show that for this class the number of surrounding tiles cannot be bounded. The first construction is based on polycubes with an L-shape but with many distinct tilings of the space. Nevertheless, we are able to construct a class of more complicated polycubes such that each polycube tiles the space ...
متن کاملMesh morphing using polycube-based cross-parameterization
In this paper, we propose a novel mesh morphing approach based on polycubic crossparameterization. We compose parameterizations over the surfaces of the polycubes whose shape is similar to that of the given meshes. Because the polycubes capture the large-scale features, we can easily preserve the shape of the models, mapping legs to legs, head to head, and so on. For the finer features that are...
متن کاملProper n-Cell Polycubes in n - 3 Dimensions
A d-dimensional polycube of size n is a connected set of n cubes in d dimensions, where connectivity is through (d − 1)-dimensional faces. Enumeration of polycubes, and, in particular, specific types of polycubes, as well as computing the asymptotic growth rate of polycubes, is a popular problem in combinatorics and discrete geometry. This is also an important tool in statistical physics for co...
متن کامل